Iterated generalized half-dominance and global game selection

نویسنده

  • Ryota Iijima
چکیده

We offer an equilibrium characterization of a general class of global games with strategic complementarities. The analysis highlights a form of acyclicity in the interim belief structure of global games, which allows us to formalize a selection criterion, iterated generalized half-dominance. This criterion is shown to be a unique global game selection when noise distributions satisfy a regularity condition. A similar logic also applies to the perfect foresight dynamics of Matsui and Matsuyama (1995); an iterated generalized half-dominant equilibrium is a unique globally stable state when agents are patient enough. The criterion is especially useful for games with more than two asymmetric players, and can be easily applied to local interaction games with an arbitrary network structure.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Order Independence for Iterated Weak Dominance

In general, the result of the elimination of weakly dominated strategies depends on order. We define nice weak dominance. Under nice weak dominance, order does not matter. We identify an important class of games under which nice weak dominance and weak dominance are equivalent, and so the order under weak dominance does not matter. For all games, the result of iterative nice weak dominance is a...

متن کامل

Generalized risk-dominance and asymmetric dynamics

This paper proposes two (ordinal and cardinal) generalizations of Harsanyi and Selten (1988) risk-dominance to multi-player, multi-action games. There are three reasons why generalized risk-dominance (GR-dominance) is interesting. Extending the logic of riskdominance, GR-dominant actions can be interpreted as best responses to conjectures that satisfy a certain type of symmetry. Second, in a lo...

متن کامل

On Iterated Dominance, Matrix Elimination, and Matched Paths

We study computational problems arising from the iterated removal of weakly dominated actions in anonymous games. Our main result shows that it is NP-complete to decide whether an anonymous game with three actions can be solved via iterated weak dominance. The two-action case can be reformulated as a natural elimination problem on a matrix, the complexity of which turns out to be surprisingly d...

متن کامل

Iterated weak dominance and subgame dominance

In this paper, we consider finite normal form games satisfying transference of decisionmaker indifference. We show that any set of strategies surviving k rounds of elimination of some weakly dominated strategies can be reduced to a set of strategies equivalent to the set of strategies surviving k rounds of elimination of all weakly dominated strategies in every round by (at most k) further roun...

متن کامل

The Relationship Between Rationality on the Matrix and the Tree∗

The relationship between the matrix and the tree has been the subject of intensive investigation ever since the beginning of game theory. The issue goes back even to Borel and von Neumann. Later, Thompson [11, 1952], followed by Elmes-Reny [4, 1994], uncovered the structural relationship between the matrix and the tree. They showed that, up to the duplication of pure strategies, two games have ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Economic Theory

دوره 159  شماره 

صفحات  -

تاریخ انتشار 2015